Reasoning about Partially Ordered Web Service Activities in PSL
نویسندگان
چکیده
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show how the first-order ontology of the Process Specification Language (PSL) can be used to represent both the queries and the process descriptions that constitute the underlying theory for the reasoning problems. We also identify extensions of the PSL Ontology for which these problems are NP-complete and then explicitly axiomatize classes of activities for which the various reasoning problems are tractable.
منابع مشابه
Generalized $F$-contractions in Partially Ordered Metric Spaces
We discuss about the generalized $F$-contraction mappings in partially ordered metric spaces. For this, we first introduce the notion of ordered weakly $F$-contraction mapping. We also present some fixed point results about this type of mapping in partially ordered metric spaces. Next, we introduce the notion of $acute{mathrm{C}}$iri$acute{mathrm{c}}$ type generalized ordered weakly $F$-contrac...
متن کاملApplications of PSL to Semantic Web Services
In this paper we will show how the ontology of the Process Specification Language can be used as an upper-level process ontology that serves as the semantic foundation for the DAML-S ontology for web services. 1 Semantics for Web Services To achieve the vision of the Semantic Web, software agents will need a computerinterpretable description of the services they offer and the information that t...
متن کاملGeneralized Weakly Contractions in Partially Ordered Fuzzy Metric Spaces
In this paper, a concept of generalized weakly contraction mappings in partially ordered fuzzy metric spaces is introduced and coincidence point theorems on partially ordered fuzzy metric spaces are proved. Also, as the corollary of these theorems, some common fixed point theorems on partially ordered fuzzy metric spaces are presented.
متن کاملPartially Ordered Runs: A Case Study
We look at some sources of insecurity and difficulty in reasoning about partially ordered runs of distributed ASMs, and propose some techniques to facilitate such reasoning. As a case study, we prove in detail correctness and deadlock–freedom for general partially ordered runs of distributed ASM models of Lamport’s Bakery Algorithm.
متن کاملGraph Summarization in Annotated Data Using Probabilistic Soft Logic
Annotation graphs, made available through the Linked Data initiative and Semantic Web, have significant scientific value. However, their increasing complexity makes it difficult to fully exploit this value. Graph summaries, which group similar entities and relations for a more abstract view on the data, can help alleviate this problem, but new methods for graph summarization are needed that han...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009